Hot Potato Techniques in High Level Synthesis

نویسندگان

  • Miodrag Potkonjak
  • Sujit Dey
چکیده

This paper introduces hot potato high level synthesis transformation techniques. These techniques add deflection operations in the behavioral description of a computation in such a way that the requirements for two important components of the final implementation cost, the number of registers and the number of interconnects, are significantly reduced. Moreover, it is shown how hot potato techniques can be effectively used during high level synthesis to minimize the partial scan overhead to make the synthesized design testable. The paper presents theoretical foundations, efficient algorithms and experimental results which indicate the wide application range and effectiveness of the new transformation technique for behavioral level synthesis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Controlling Hot Potatoes in Intradomain Traffic Engineering

The growth in Internet connectivity at the Autonomous System (AS) level and the practice of ”hot potato” routing has increased the possibility of interaction between intradomain and interdomain traffic engineering (TE). Hot potato routing occurs when a router inside an AS knows of multiple exit points out of the AS towards a destination, and selects the one that is ”closest” to it. The closenes...

متن کامل

Shortest-path and Hot-potato Routing on Unbuuered Toroidal Networks

We probabilistically model dynamic packet routing on unbuuered 2-D and 3-D toroidal networks. We consider shortest-path routing with packet loss and retrans-missions versus a newly proposed all-link busy (ALB) hot-potato routing strategy with packet deeections. Computations of the sustained packet generating rate, node throughput, and average packet latency indicate that the proposed ALB strate...

متن کامل

Shortest-path and Hot-potato Routing on Unbuuered 2-d Tori

We probabilistically model dynamic routing on un-buuered 2-dimensional tori. We consider shortest-path routing with packet loss and retransmissions versus a newly proposed all-link busy (ALB) hot-potato routing strategy with packet deeections. Computations of the sustained packet generating rate, node through-put, and average packet latency indicate that the proposed ALB strategy is a much bett...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995